Weight spectrum of codes associated with the Grassmannian G(3,7)

نویسندگان

  • Krishna V. Kaipa
  • Harish K. Pillai
چکیده

In this paper we consider the problem of determining the weight spectrum of q-ary codes C(3,m) associated with Grassmann varieties G(3,m). For m = 6 this was done in [1]. We derive a formula for the weight of a codeword of C(3,m), in terms of certain varieties associated with alternating trilinear forms on F q . The classification of such forms under the action of the general linear group GL(m,Fq) is the other component that is required to calculate the spectrum of C(3,m). For m = 7, we explicitly determine the varieties mentioned above. The classification problem for alternating 3-forms on F was solved in [2] which we then use to determine the spectrum of C(3, 7).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grassmannian Codes as Lifts of Matrix Codes Derived as Images of Linear Block Codes over Finite Fields

Let p be a prime such that p ≡ 2 or 3 (mod 5). Linear block codes over the non-commutative matrix ring M2(Fp) endowed with the Bachoc weight are derived as isometric images of linear block codes over the Galois field Fp2 endowed with the Hamming metric. When seen as rank metric codes, this family of matrix codes satisfies the Singleton bound and thus are maximum rank distance codes, which are t...

متن کامل

Matrix Codes as Ideals for Grassmannian Codes and their Weight Properties

Abstract—A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field Fp is introduced. The matrix codes are Fp-subspaces of the ring M2(Fp) of 2 × 2 matrices over Fp on which the rank metric is applied, and are generated as onesided proper principal ideals by idempotent elements of M2(Fp). Furthermore a weight function on ...

متن کامل

Minimum distance of Symplectic Grassmann codes

In this paper we introduce Symplectic Grassmann codes, in analogy to ordinary Grassmann codes and Orthogonal Grassmann codes, as projective codes defined by symplectic Grassmannians. Lagrangian–Grassmannian codes are a special class of Symplectic Grassmann codes. We describe all the parameters of line Symplectic Grassmann codes and we provide the full weight enumerator for the Lagrangian–Grassm...

متن کامل

Line Hermitian Grassmann Codes and their Parameters

In this paper we introduce and study line Hermitian Grassmann codes as those subcodes of the Grassmann codes associated to the $2$-Grassmannian of a Hermitian polar space defined over a finite field of square order. In particular, we determine their parameters and characterize the words of minimum weight.

متن کامل

The structure of dual Grassmann codes

In this article we study the duals of Grassmann codes, certain codes coming from the Grassmannian variety. Exploiting their structure, we are able to count and classify all their minimum weight codewords. In this classification the lines lying on the Grassmannian variety play a central role. Related codes, namely the affine Grassmann codes, were introduced more recently in [1], while their dual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 59  شماره 

صفحات  -

تاریخ انتشار 2013